An embarrassingly simple approach to neural multiple instance classification
نویسندگان
چکیده
منابع مشابه
An embarrassingly simple approach to zero-shot learning
Zero-shot learning consists in learning how to recognise new concepts by just having a description of them. Many sophisticated approaches have been proposed to address the challenges this problem comprises. In this paper we describe a zero-shot learning approach that can be implemented in just one line of code, yet it is able to outperform state of the art approaches on standard datasets. The a...
متن کاملSingle- vs. multiple-instance classification
In multiple-instance (MI) classification, each input object or event is represented by a set of instances, named a bag, and it is the bag that carries a label. MI learning is used in different applications where data is formed in terms of such bags and where individual instances in a bag do not have a label. We review MI classification from the point of view of label information carried in the ...
متن کاملSimple Incremental Instance Selection Wrapper for Classification
Instance selection methods are very useful data mining tools for dealing with large data sets. There exist many instance selection algorithms capable for significant reduction of training data size for particular classifier without generalization degradation. In opposition to those methods, this paper focuses on general pruning methods which can be successfully applied for arbitrary classificat...
متن کاملRevisiting multiple instance neural networks
Recently neural networks and multiple instance learning are both attractive topics in Artificial Intelligence related research fields. Deep neural networks have achieved great success in supervised learning problems, and multiple instance learning as a typical weakly-supervised learning method is effective for many applications in computer vision, biometrics, nature language processing, etc. In...
متن کاملMultiple Instance Classification via Successive Linear Programming
The multiple instance classification problem [6,2,12] is formulated using a linear or nonlinear kernel as the minimization of a linear function in a finite dimensional (noninteger) real space subject to linear and bilinear constraints. A linearization algorithm is proposed that solves a succession of fast linear programs that converges in a few iterations to a local solution. Computational resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2019
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2019.10.022